traversable graph

См. также в других словарях:

• Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… …   Wikipedia

• Eulerian path — In graph theory, an Eulerian path is a path in a graph which visits each edge exactly once. Similarly, an Eulerian circuit is an Eulerian path which starts and ends on the same vertex. They were first discussed by Leonhard Euler while solving the …   Wikipedia

• Closed timelike curve — In mathematical physics, a closed timelike curve (CTC) is a worldline in a Lorentzian manifold, of a material particle in spacetime that is closed, returning to its starting point. This possibility was first raised by Kurt Gödel in 1949, who… …   Wikipedia

• Mini-map — The computer game Freeciv uses a minimap, it is the bottom left corner. On this minimap the white rectangle represents the area of the map currently visible on the main screen. The different colors represent land and ocean and the territories of… …   Wikipedia

• Tachyon — A tachyon (from the Greek polytonic|ταχυόνιον, takhyónion , from polytonic|ταχύς, takhýs , i.e. swift, fast) is any hypothetical particle that travels at faster than light speed. The first description of tachyons is attributed to German physicist …   Wikipedia

• Automap — In video games, an automap is a navigational aid used mainly for virtual worlds that are expansive or maze like. An automap is typically an abstract top down view of nearby areas of the game world, automatically updated as the player character… …   Wikipedia

• Ciclo euleriano — Un ciclo euleriano es aquel camino que recorre todas las aristas de un grafo pasando una y sólo una vez por cada arco (arista) del grafo, siendo condición necesaria que regrese al vértice inicial de salida (ciclo = camino en un grafo donde… …   Wikipedia Español